A structural approach to graph transformation based on symmetric Petri nets

Graph Transformation Systems (GTS) and Petri Nets (PN) are two central, theoretically sound, formal models for concurrent or distributed systems. A lot of papers have focused on the relationship between GTS PN. It is generally accepted that PN instances due to lack ability adapt reconfigure their structure. In this paper, which extends a recent one, we reverse perspective by presenting definition in terms Symmetric (SN). SN standard High-Level formalism featuring compact syntax highlights behavioral symmetries The major strength lies possibility using well-established tools edit/efficiently analyze (SN-based) graph transformation models. We follow structural approach, based newly implemented symbolic calculus, validate Rules (GTR) formally verify properties. second part supply semantic characterization SN-based model, carrying out thorough comparison with classical, algebraic double-pushout (DPO) approach. constructively show how translate any DPO rule corresponding, elementary composite, rule. treat both injective non-injective rules/rule matches. shows approach is, some sense, generalization DPO.